Path partition for graphs with special blocks

نویسندگان

Jun-Jie Pan

Gerard J. Chang

چکیده

The path-partition problem is to find a minimum number of vertex-disjoint paths that cover all vertices of a given graph. This paper studies the path-partition problem from an algorithmic point of view. As the Hamiltonian path problem is NP-complete for many classes of graphs, so is the path-partition problem. The main result of this paper is to present a linear-time algorithm for the path-partition problem in graphs whose blocks are complete graphs, cycles or complete bipartite graphs. © 2004 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The upper domatic number of powers of graphs

Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...

متن کامل

The Path-partition Problem in Bipartite Distance-hereditary Graphs

A path partition of a graph is a collection of vertex-disjoint paths that cover all vertices of the graph. The path-partition problem is to find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.

متن کامل

NP-completeness results for some problems on subclasses of bipartite and chordal graphs

Extending previous NP-completeness results for the harmonious coloring problem and the pair-complete coloring problem on trees, bipartite graphs and cographs, we prove that these problems are also NP-complete on connected bipartite permutation graphs. We also study the k-path partition problem and, motivated by a recent work of Steiner [G. Steiner, On the k-path partition of graphs, Theoret. Co...

متن کامل

New results on upper domatic number of graphs

For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...

متن کامل